Inferring Types for Parallel Programs
نویسندگان
چکیده
The Message Passing Interface (MPI) framework is widely used in implementing imperative programs that exhibit a high degree of parallelism. The PARTYPES approach proposes a behavioural type discipline for MPI-like programs in which a type describes the communication protocol followed by the entire program. Well-typed programs are guaranteed to be exempt from deadlocks. In this paper we describe a type inference algorithm for a subset of the original system; the algorithm allows to statically extract a type for an MPI program from its source code.
منابع مشابه
Inferring Program Specifications in Polynomial-Time
We consider the problem of automatically inferring properties of programs. Our approach is to explore the application of familiar type inference principles to a \type system" suuciently expressive that the typing problem is eeectively the checking of program speciications. We use familiar syntax-directed type inference rules to give a polynomial-time procedure for inferring type theorems in thi...
متن کاملLower-bound Time-complexity Analysis of Logic Programs
The paper proposes a technique for inferring conditions on goals that, when satisfied, ensure that a goal is sufficiently coarse-grained to warrant parallel evaluation. The method is powerful enough to reason about divide-and-conquerprograms, and in the case of quicksort, for instance, can infer that a quicksort goal has a time complexity that exceeds 64 resolution steps (a threshold for spawni...
متن کاملType Theory and Projections for Static
A system of annotated types is proposed as a means of describing and inferring static information, such as strictness and constancy, about functional programs. An abstract semantics is given in terms of projections. A close connection between annotated type assignment and projection analysis is demonstrated.
متن کاملSound, Precise and Efficient Static Race Detection for Multi-Threaded Programs
Title of dissertation: Sound, precise and efficient static race detection for multi-threaded programs Polyvios Pratikakis Doctor of Philosophy, 2008 Dissertation directed by: Professor Michael Hicks Professor Jeffrey S. Foster Department of Computer Science Multi-threaded programming is increasingly relevant due to the growing prevalence of multi-core processors. Unfortunately, the non-determin...
متن کاملDependent Types for Program Understanding
Weakly-typed languages such as Cobol often force programmers to represent distinct data abstractions using the same low-level physical type. In this paper, we describe a technique to recover implicitlydefined data abstractions from programs using type inference. We present a novel system of dependent types which we call guarded types, a pathsensitive algorithm for inferring guarded types for Co...
متن کامل